A Logic for Representing Grammatical Knowledge

نویسنده

  • B. Keller
چکیده

Feature structures are partially speciied, record-like structures which are employed in many recent grammar formalisms to represent linguistic objects of various kinds. Building on previous approaches to the logical representation of linguistic knowledge, this paper presents a logical language which is suuciently expressive to allow for the encoding of recursive constraints on feature structures. A particular concern of this paper is to show how formulas of the logic can be used to capture the denotation of a grammar considered as a recursive deenition of a class of linguistic objects. However, the logic may be of interest to researchers working in the area of general knowledge representation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigating the relationship among complexity, range, and strength of grammatical knowledge of EFL students

Assessment  of  grammatical  knowledge  is  a  rather  neglected  area  of  research  in  the  field with  many  open  questions  (Purpura,  2004).  The  present  research  incorporates  recent proposals  about  the  nature  of  grammatical  development  to  create  a  framework  consisting of dimensions of complexity, range and strength, and studies which dimension(s) can best predict the stat...

متن کامل

Natural language semantics in biproduct dagger categories

Biproduct dagger categories serve as models for natural language. In particular, the biproduct dagger category of finite dimensional vector spaces over the field of real numbers accommodates both the extensional models of predicate calculus and the intensional models of quantum logic. The morphisms representing the extensional meanings of a grammatical string are translated to morphisms represe...

متن کامل

Representing Constraints with Automata

In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the assignments which make the formulas true. We show that this allows an efficient representation of knowledge about the content of constraints which can be use...

متن کامل

The Effect of Task Repetition under Different Time Conditions on EFL Learners' Oral Performance and Grammatical Knowledge Gain

This quasi-experimental study aimed to investigate the effect of task repetition under four conditions on the three dimensions of oral production (accuracy, complexity and fluency) and grammatical knowledge gain of learners of English as a Foreign Language (EFL). 40 young learners of English as a Foreign Language in four classes were randomly assigned into one of the following groups: repetitio...

متن کامل

Intelligent Parsing and Grammatical Inference – A Knowledge-Based Approach

Starting from first principles, we have designed a rule-based firstorder logic (FOL) knowledge-based system (KBS), called EXPARS, and coupled it with an original inductive learning module for the purpose of grammatical inference. While we stress the flexibility of the KBS approach as applied to parsing, we also raise the issues imposed by such a coupling. The interaction between EXPARS and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992